Categorical Models for Simply Typed Resource Calculi
نویسندگان
چکیده
منابع مشابه
Categorical Models for Simply Typed Resource Calculi
We introduce the notion of differential λ-category as an extension of Blute-Cockett-Seely’s differential Cartesian categories. We prove that differential λ-categories can be used to model the simply typed versions of: (i) the differential λ-calculus, a λ-calculus extended with a syntactic derivative operator; (ii) the resource calculus, a non-lazy axiomatisation of Boudol’s λ-calculus with mult...
متن کاملCategorical completeness results for the simply-typed lambda-calculus
We investigate, in a categorical setting, some completeness properties of beta-eta conversion between closed terms of the simply-typed lambda calculus. A cartesian-closed category is said to be complete if, for any two unconvertible terms, there is some interpretation of the calculus in the category that distinguishes them. It is said to have a complete interpretation if there is some interpret...
متن کاملFinite Vector Spaces as Model of Simply-Typed Lambda-Calculi
In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite models, one based on finite sets and the other on finite vector spaces. The first model is shown to be fully complete with respect to the operational semanti...
متن کاملTyped lambda calculi and possible worlds models
Course overview (current plan; adjustable) i. Typed lambda calculi and possible worlds models ii. Alternative approaches to meaning iii. Grounded language understanding iv. Question answering: Grounding in databases v. Stochastic lambda calculus vi. Distributional approaches to word meanings vii. Composition in vector-space models 1: tensors viii. Composition in vector-space models 2: recursive...
متن کاملCalculi of Generalised -Reduction and Explicit Substitutions: The Type Free and Simply Typed Versions
Extending the-calculus with either explicit substitution or generalised reduction has been the subject of extensive research recently and still has many open problems. This paper is the rst investigation into the properties of a calculus combining both generalised reduction and explicit substitutions. We present a calculus, gs, that combines a calculus of explicit substitution, s, and a calculu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2010
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2010.08.013